A computational optimization research on ant colony optimization for the traveling salesman problem

Abstract The traveling salesman problem (TSP) is one of typical combinatorial optimization problems. Ant colony (ACO) an effective method to solve the problem, but there are some non-negligible shortcomings hidden in original algorithm. primary objective this research optimize ACO produce quality work throughout solving TSP. To end, hybrid SOS-MMAS algorithm proposed. Concretely, apply advanced Max-Min System (MMAS) as basic raise task scheduling efficiency, meanwhile introduce symbiotic organisms search (SOS) into MMAS key parameters. Experiments were carried out on TSP instances different scales, and SOS-ACO algorithms compared with SOS-MMAS, which proved excellent performance Rationality design high has been illuminated by experimentation. In addition, model also could serve suggest further or other related areas.